Linear Time Recognition of Bipartite Star123-Free Graphs
نویسنده
چکیده
In this paper, we present a linear time recognition algorithm for recognizing bipartite graphs without induced subgraphs isomorph to star123. Bipartite star123-free graphs are a natural generalization of both weak bisplit and Star123, Sun4free bipartite graphs, both further generalizing bicographs.
منابع مشابه
Solving the Maximum Matching Problem on Bipartite Star123-Free Graphs in Linear Time
The bipartite Star123-free graphs were introduced by V. Lozin in [1] to generalize some already known classes of bipartite graphs. In this paper, we extend to bipartite Star123-free graphs a linear time algorithm of J. L. Fouquet, V. Giakoumakis and J. M. Vanherpe for finding a maximum matching in bipartite Star123, P7-free graphs presented in [2]. Our algorithm is a solution of Lozin’s conject...
متن کاملAn O(n) Time Algorithm For Maximum Induced Matching In Bipartite Star_123-free Graphs
A matching in a graph is a set of edges no two of which share a common vertex. A matching M is an induced matching if no edge connects two edges of M. The problem of finding a maximum induced matching is known to be NP-hard in general and specifically for bipartite graphs. Lozin has been proposed an O(n) time algorithm for this problem on the class of bipartite Star123, Sun4-free graphs. In thi...
متن کاملA note on module-composed graphs
In this paper we consider module-composed graphs, i.e. graphs which can be defined by a sequence of single vertex insertions v1, . . . , vn, such that the neighbourhood of vertex vi, 2 ≤ i ≤ n, forms a module (a homogenous set) of the graph defined by vertices v1, . . . , vi−1. Module composed graphs are HHDS-free and thus homogeneous orderable, weakly chordal, and perfect. Every bipartite dist...
متن کامل$C_4$-free zero-divisor graphs
In this paper we give a characterization for all commutative rings with $1$ whose zero-divisor graphs are $C_4$-free.
متن کاملSome lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. Arab J. Inf. Technol.
دوره 3 شماره
صفحات -
تاریخ انتشار 2006